/*
*	ID : Pallab
* 	PROG : B
* 	LANG : C++
* 	2012-11-30-22.09.12 Friday
*
* 	"I have not failed, I have just found 10000 ways that won't work.
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

inline void wait(double seconds) {
    double endtime = clock() + (seconds * CLOCKS_PER_SEC);
    while (clock() < endtime) {
        ;
    }
}
template<class T>
inline T fastIn() {
    register char c=0;
    register T a=0;
    bool neg=false;
    while(c<33)c=getchar();
    while(c>33) {
        if(c=='-') {
            neg=true;
        } else {
            a= (a*10)+(c-'0');
        }
        c=getchar();
    }
    return neg?-a:a;
}
int result[12];
int len,query_count;
string ss;
inline void print() {
    foE(i,0,9)cout<<result[i]<<' ';
    line;
}
inline void read() {
    len=fastIn<int>(),query_count=fastIn<int>();
    cin>>ss;
}
#define RIGHT 1
#define LEFT 0
bool marked[200];
string S;
inline void solve(int l, int r) {
    SET(result,0);
    SET(marked,false);
    S=ss;


    int cur_dir=RIGHT;
    int cur_pos=l;
    int prev=-1;
    while(true) {
        if(cur_pos<l||cur_pos>r)break;
        if( !marked[cur_pos] ) {
            if(isdigit(S[cur_pos])) {
                ++result[S[cur_pos]-'0'];
                if(S[cur_pos]=='0')marked[cur_pos]=true;
                else --S[cur_pos];
                cur_pos = cur_pos+(cur_dir==RIGHT?+1:-1);
                prev=-1;
            } else {
                if(prev!=-1)marked[prev]=true;
                //change the direction accordingly
                cur_dir = S[cur_pos]=='>'?RIGHT:LEFT;
                prev=cur_pos;
                cur_pos = cur_pos+(cur_dir==RIGHT?+1:-1);
            }
        } else {
            cur_pos = cur_pos+ (cur_dir==RIGHT?+1:-1);
        }
    }
}
inline void proc() {
    int l,r;
    fo(i,query_count) {
        l=fastIn<int>()-1,r=fastIn<int>()-1;
        //----------------------
        solve(l,r);
        print();
        //----------------------
    }
}
int main() {
    int kase = 1;
#if defined( xerxes_pc )
    if (!freopen("in1", "r", stdin))
        puts("error opening file in "), assert(0);
    kase = 1;
#endif
    fo(i,kase) {
        read();
        proc();
    }
    return 0;
}
